Oriented Equational Logic Programming is Complete
نویسندگان
چکیده
منابع مشابه
Oriented Equational Logic Programming is Complete
We show the completeness of an extension of SLDDresolution to the equational setting. This proves a conjecture of Laurent Fribourg and shows the completeness of an implementation of his. It is the rst completeness result for superposition of equational Horn clauses which reduces to SLD resolution in the nonnequational case. The inference system proved complete is actually more general than the ...
متن کاملOn Extra Variables in (Equational) Logic Programming
Extra variables in a clause are variables which occur in the body but not in the head. It has been argued that extra variables are necessary and contribute to the expressive power of logic languages. In the first part of this paper, we show that this is not true in general. For this purpose, we provide a simple syntactic transformation of each logic program into a logic program without extra va...
متن کاملEquational Logic Programming Actions, and Change
Recently three approaches for solving planning problems deductively were proposed each of which does not require to state frame axioms explicitly. These approaches are based on the linear connection method, an equational logic programming language, and on linear logic. In this paper, we briefly review these approaches and show that they are equivalent. Moreover, we illustrate that these approac...
متن کاملTerm-Rewriting Implementation of Equational Logic Programming
1987 ABSTRACT In 1975 I started a small project to explore the consequences of implementing equational programs with no semantic compromises. Latest results include a compiler that executes exactly the logical consequences of an equa-tional program, with run-time speed comparable to compiled Franz LISP. This paper describes the accomplishments of the project very brieey, concentrating on shortc...
متن کاملProgramming in Equational Logic: Beyond Strong Sequentiality
Orthogonal term rewriting systems (also known as regular systems) provide an elegant framework for programming in equational logic. O'Donnell showed that the parallel-outermost strategy, which replaces all outermost redexes in each step, is complete for such systems. Many of the reductions performed by this strategy could be wasteful in general. A lazy normalization algorithm that completely el...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1997
ISSN: 0747-7171
DOI: 10.1006/jsco.1996.0075